package practice_3_2;
//递归求 N 的阶乘
public class RecursiveFactorial {
    public static void main(String[] args) {
        int n = 6;
        long ret = recursiveFactorial(n);
        System.out.println(ret);
    }
    //递归求n的阶乘
    public static long recursiveFactorial(long n){
        if(n == 0)
            return 1;
        return n * recursiveFactorial(n - 1);
    }
}
